An LTL SAT Encoding for Behavioral Diagnosis
نویسندگان
چکیده
Assisting designers in writing high-quality specifications is an important step towards minimizing product defects and rework efforts. Drawing on the attractive performance of satisfiability solvers, in this paper, we present a SAT encoding that enables an efficient model-based diagnosis of LTL specifications in the context of behavioral samples (traces). The resulting diagnoses at operator level and our experimental results illustrate our approach’s viability and attractiveness.
منابع مشابه
Behavioral Diagnosis of LTL Specifications at Operator Level
Product defects and rework efforts due to flawed specifications represent major issues for a project’s performance, so that there is a high motivation for providing effective means that assist designers in assessing and ensuring a specification’s quality. Recent research in the context of formal specifications, e.g. on coverage and vacuity, offers important means to tackle related issues. In th...
متن کاملLogic Programs and Classical Planning with LTLConstraints
The paper deals with encoding planning problems with LTL constraints as disjunctive logic programs (LP ) and computing the plans (answer sets) under the stable model semantics. In order to encode the problem as a logic program, we use a well known SAT encoding of classical planning problems. Observing that obtaining the LP encoding for the LTL constraints results in an exponential blowup in the...
متن کاملAlternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic (Extended Version)
We present two algorithms for bounded model checking of Regular Linear Temporal Logic (RLTL) specifications. Bounded model checking (BMC) is an effective algorithmic method for the verification of finite state systems against temporal specifications expressed in some linear temporal logic, typically LTL. The basis of BMC consists on encoding the existence of a counterexample trace of bounded de...
متن کاملTemporal logic encodings for SAT-based bounded model checking
Since its introduction in 1999, bounded model checking (BMC) has quickly become a serious and indispensable tool for the formal verification of hardware designs and, more recently, software. By leveraging propositional satisfiability (SAT) solvers, BMC overcomes some of the shortcomings of more conventional model checking methods. In model checking we automatically verify whether a state transi...
متن کاملFast LTL Satisfiability Checking by SAT Solvers
Satisfiability checking for Linear Temporal Logic (LTL) is a fundamental step in checking for possible errors in LTL assertions. Extant LTL satisfiability checkers use a variety of different search procedures. With the sole exception of LTL satisfiability checking based on bounded model checking, which does not provide a complete decision procedure, LTL satisfiability checkers have not taken ad...
متن کامل